Nearly Recurrent Components in 3D Piecewise Constant Vector Fields
نویسندگان
چکیده
We present an algorithm for computing nearly recurrent components, that represent areas of close to circulating or stagnant flow, for 3D piecewise constant (PC) vector fields defined on regular grids. Using a number of analytical and simulated data sets, we demonstrate that nearly recurrent components can provide interesting insight into the topological structure of 3D vector fields. Our approach is based on prior work on Morse decompositions for PC vector fields on surfaces and extends concepts previously developed with this goal in mind to the case of 3D vector fields defined on regular grids. Our contributions include a description of trajectories of 3D piecewise constant vector fields and an extension of the transition graph, a finite directed graph that represents all trajectories, to the 3D case. Nearly recurrent components are defined by strongly connected components of the transition graph.
منابع مشابه
Morse Decomposition of 3D Piecewise Linear Vector Fields
Morse decomposition has been shown a reliable way to compute and represent vector field topology. Its computation first converts the original vector field into a directed graph representation, so that flow recurrent dynamics (i.e., Morse sets) can be identified as some strongly connected components of the graph. In this paper, we present a framework that enables the user to efficiently compute ...
متن کاملDynamic Frailty and Change Point Models for Recurrent Events Data
Abstract. We present a Bayesian analysis for recurrent events data using a nonhomogeneous mixed Poisson point process with a dynamic subject-specific frailty function and a dynamic baseline intensity func- tion. The dynamic subject-specific frailty employs a dynamic piecewise constant function with a known pre-specified grid and the baseline in- tensity uses an unknown grid for the piecewise ...
متن کاملOn the Closing Lemma for Planar Piecewise Smooth Vector Fields
A large number of papers deal with “Closing Lemmas” for Cr-vector fields (and Cr-diffeomorphisms). Here, we introduce this subject and formalize the terminology about nontrivially recurrent points and nonwandering points for the context of planar piecewise smooth vector fields. A global bifurcation analysis of a special family of piecewise smooth vector fields presenting a nonwandering set with...
متن کاملTopological Construction and Visualization of Higher Order 3D Vector Fields
We present the first algorithm for constructing 3D vector fields based on their topological skeleton. The skeleton itself is modeled by interactively moving a number of control polygons. Then a piecewise linear vector field is automatically constructed which has the same topological skeleton as modeled before. This approach is based on a complete segmentation of the areas around critical points...
متن کاملThe Intractability of Face Reachability in 3D Visit-Once Piecewise-Constant Derivative Systems
We consider a class of three-dimensional dynamical systems whose state spaces are defined by piecewise constant vector fields and whose trajectories never return to a state-space region once they exit the region. We demonstrate that the reachability problem for this class of systems is decidable while the computation is provably intractable. We prove the intractability (i.e., PSPACE-completenes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 31 شماره
صفحات -
تاریخ انتشار 2012